A Lower Bound for the Size of a Minkowski Sum of Dilates

نویسندگان

  • Yahya Ould Hamidoune
  • Juanjo Rué
چکیده

Let A be a finite nonempty set of integers. An asymptotic estimate of several dilates sum size was obtained by Bukh. The unique known exact bound concerns the sum |A + k ·A|, where k is a prime and |A| is large. In its full generality, this bound is due to Cilleruelo, Serra and the first author. Let k be an odd prime and assume that |A| > 8kk. A corollary to our main result states that |2 · A + k · A| ≥ (k + 2)|A| − k2 − k + 2. Notice that |2 · P + k · P | = (k + 2)|P | − 2k, if P is an arithmetic progression.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Relative Stanley–reisner Theory and Lower Bound Theorems for Minkowski Sums

This note complements an earlier paper of the author by providing a lower bound theorem for Minkowski sums of polytopes. In [AS16], we showed an analogue of McMullen’s Upper Bound theorem for Minkowski sums of polytopes, estimating the maximal complexity of such a sum of polytopes. A common question in reaction to that research was the question for an analogue for the Barnette’s Lower Bound The...

متن کامل

A Single Machine Sequencing Problem with Idle Insert: Simulated Annealing and Branch-and-Bound Methods

  In this paper, a single machine sequencing problem is considered in order to find the sequence of jobs minimizing the sum of the maximum earliness and tardiness with idle times (n/1/I/ETmax). Due to the time complexity function, this sequencing problem belongs to a class of NP-hard ones. Thus, a special design of a simulated annealing (SA) method is applied to solve such a hard problem. To co...

متن کامل

Heuristic approach to solve hybrid flow shop scheduling problem with unrelated parallel machines

In hybrid flow shop scheduling problem (HFS) with unrelated parallel machines, a set of n jobs are processed on k machines. A mixed integer linear programming (MILP) model for the HFS scheduling problems with unrelated parallel machines has been proposed to minimize the maximum completion time (makespan). Since the problem is shown to be NP-complete, it is necessary to use heuristic methods to ...

متن کامل

Comparison between Frequentist Test and Bayesian Test to Variance Normal in the Presence of Nuisance Parameter: One-sided and Two-sided Hypothesis

 This article is concerned with the comparison P-value and Bayesian measure for the variance of Normal distribution with mean as nuisance paramete. Firstly, the P-value of null hypothesis is compared with the posterior probability when we used a fixed prior distribution and the sample size increases. In second stage the P-value is compared with the lower bound of posterior probability when the ...

متن کامل

A Brunn-minkowski Inequality for the Integer Lattice

A close discrete analog of the classical Brunn-Minkowksi inequality that holds for finite subsets of the integer lattice is obtained. This is applied to obtain strong new lower bounds for the cardinality of the sum of two finite sets, one of which has full dimension, and, in fact, a method for computing the exact lower bound in this situation, given the dimension of the lattice and the cardinal...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Combinatorics, Probability & Computing

دوره 20  شماره 

صفحات  -

تاریخ انتشار 2011